Dynamic Nearest Neighbour Search With Keywords
نویسندگان
چکیده
منابع مشابه
Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing
Existing methods for retrieving k-nearest neighbours suffer from the curse of dimensionality. We argue this is caused in part by inherent deficiencies of space partitioning, which is the underlying strategy used by almost all existing methods. We devise a new strategy that avoids partitioning the vector space and present a novel randomized algorithm that runs in time linear in dimensionality an...
متن کاملNearest Neighbour Search for Visualization Using Arbitrary Triangulations Nearest Neighbour Search for Visualization Using Arbitrary Triangulations
In visualization of scattered data, one is often faced with the problem of nding the nearest neighbours of a data site. This task frequently occurs in an advanced stage of the visualization process, where several data structures have been created during run time. Many applications compute a triangulation of the data for their visualization purposes. To take advantage of this previously allocate...
متن کاملNearest Neighbour Search For XML Trees
There is a significant research effort on efficient computing of similarities between objects of non traditional data types as strings, documents, sound tracks or pictures. It is reasonable to use the results of these efforts in the problem of XML tree matching, too. As an XML document has a tree structure and the trees can be transformed into a linear structure, a tree can be regarded as a spe...
متن کاملGPU Bucket Sort Algorithm with Applications to Nearest-neighbour Search
We present an adoption of the bucket sort algorithm capable of running entirely on GPU architecture. Our implementation employs render-to-texture to enable scatter operation. Linked lists of elements in each bucket are build and stored directly in video memory. We show also the use of this sorting method in a particle-based simulation. Dissipative Particle Dynamics is the physical model of choi...
متن کاملApproximate Nearest-Neighbour Search with Inverted Signature Slice Lists
In this paper we present an original approach for finding approximate nearest neighbours in collections of locality-sensitive hashes. The paper demonstrates that this approach makes high-performance nearest-neighbour searching feasible on Web-scale collections and commodity hardware with minimal degradation in search quality.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IJARCCE
سال: 2015
ISSN: 2278-1021
DOI: 10.17148/ijarcce.2015.43139